Secure strong mapping computing systems, methods, secure computing apparatus and program

ABSTRACT

A secure strong mapping computing system is a secure joining system including a plurality of secure computing apparatuses. The plurality of secure computing apparatuses include a first vector joining unit 11n, a first permutation calculation unit 12n, a first vector generation unit 13n, a second vector joining unit 14n, a first permutation application unit 15n, a second vector generation unit 16n, a first inverse permutation application unit 17n, and a first vector extraction unit 18n.

TECHNICAL FIELD

The present invention relates to techniques for computing mapping in secure computation.

BACKGROUND ART

A mapping protocol described in Non-Patent Literature 1 is known as a conventional technique for mapping computation.

Prior Art Literature Non-Patent Literature

Non-Patent Literature 1: Koki Hamada, Dai Ikarashi, and Koji Chida, “A Batch Mapping Algorithm for Secure Function Evaluation”, The transactions of the Institute of Electronics, Information and Communication Engineers, Vol. J96-A, No. 4, pp. 157-165

SUMMARY OF THE INVENTION Problems to be Solved by the Invention

The conventional mapping protocol, however, cannot detect outliers because a domain of definition is intervals (such as [1, 3]→1, [4, 8]→5, [9, 10]→2; there is no gap in the domain of definition).

The present invention is aimed at providing a secure strong mapping computing system, methods, a secure computing apparatus, and a program that can perform mapping computation while detecting outliers.

Means to Solve the Problems

A secure strong mapping computing system according to an aspect of the present invention is a secure joining computing system including a plurality of secure computing apparatuses, where F_(k) and F_(v) are arbitrary rings; [α] is a share generated by secret sharing of α, with α being an arbitrary vector or permutation; m and n are predetermined integers greater than or equal to 1; u is a predetermined value; r∈F_(k) ^(m) is a predetermined vector with elements different from each other; and d∈F_(v) ^(m) and x∈F_(k) ^(n) are predetermined vectors. The plurality of secure computing apparatuses include: a plurality of first vector joining units that use a share [r] of the vector r and a share [x] of the vector x to generate a share [k] of a vector k ∈[F_(k)]^(2m+n) which is generated by joining the vector r, the vector x, and the same vector as the vector r; a plurality of first permutation calculation units that use the share [k] to generate a share [σ] of a permutation σ for stable sorting of the vector k; a plurality of first vector generation units that use a share [d] of the vector d and u to generate a share [d′] of a vector d′, which is a vector generated by subtracting u from respective elements of the vector d; a plurality of second vector joining units that use the share [d′] to generate a share [v] of a vector v∈[F_(v)]^(2m+n) which is generated by joining the vector d′, a 0-vector with a number of elements of n, and a vector −d′ which is a vector generated by inverting signs of respective elements of the vector d′; a plurality of first permutation application units that use the share [v] and the share [σ] to generate a share [σ(v)] of a vector σ(v) which is generated by application of the permutation σ to the vector v; a plurality of second vector generation units that use the share [σ(v)] to generate a share [σ(y)] of a vector σ(y), each element of which is a sum of the u and a sum of elements of the vector σ(v) up to an element corresponding to that element, the elements including the element corresponding to that element; a plurality of first inverse permutation application units that use the share [σ(y)] and the share [σ] to generate a share [σ⁻¹(σ(y))] of a vector σ⁻¹(σ(y)) which is generated by application of an inverse permutation σ⁻¹ of the permutation σ to the vector σ(y); and a plurality of first vector extraction units that use the share [σ⁻¹(σ(y))] to obtain a share [y] of a vector y which is generated by extracting m+1th to m+nth elements of the vector σ⁻¹(σ(y)).

Effects of the Invention

Mapping computation can be performed while detecting outliers.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates a functional configuration of a secure strong mapping computing system and a secure joining system.

FIG. 2 illustrates a functional configuration of a secure computing apparatus for secure strong mapping computation.

FIG. 3 illustrates a processing procedure of a secure strong mapping computing method.

FIG. 4 illustrates a functional configuration of a secure computing apparatus of a secure joining system for performing left outer join.

FIG. 5 illustrates a processing procedure of a secure joining method for performing left outer join.

FIG. 6 illustrates a functional configuration of a secure computing apparatus of a secure joining system for performing right-left outer join.

FIG. 7 illustrates a processing procedure of a secure joining method for performing right outer join.

FIG. 8 illustrates a functional configuration of a secure computing apparatus of a secure joining system for performing full outer join.

FIG. 9 illustrates a processing procedure of a secure joining method for performing full outer join.

DETAILED DESCRIPTION OF THE EMBODIMENTS

Embodiments of the present invention are described below in detail. In the drawings, components having the same function are given the same reference characters and overlapping description is omitted.

[Secure Strong Mapping Computing System and Method]

Referring to FIG. 1, an exemplary configuration of a secure strong mapping computing system according to an embodiment is described. The secure strong mapping computing system includes N (≥2) secure computing apparatuses 1 ₁, . . . , 1 _(N). In this embodiment, the secure computing apparatuses 1 ₁, . . . , 1 _(N) are each connected to a communication network 2. The communication network 2 is a circuit-switched or packet-switched communication network configured to allow communications between connected apparatuses, and can be the Internet, a local area network (LAN), a wide area network (WAN), and the like, for example. The apparatuses do not necessarily be capable of communicating online via the communication network 2. For example, they may be configured such that information entered to the secure computing apparatuses 1 ₁, . . . , 1 _(N) is stored in a portable recording medium such as magnetic tape or a USB memory and the information is entered offline to the secure computing apparatuses 1 ₁, . . . , 1 _(N) from the portable recording medium.

Referring to FIG. 2, an exemplary configuration of a secure computing apparatus 1 _(n) (n=1, . . . , N) included in the secure strong mapping computing system is described. As shown in FIG. 2, the secure computing apparatus 1 _(n) of the secure strong mapping computing system includes a first vector joining unit 11 _(n), a first permutation calculation unit 12 _(n), a first vector generation unit 13 _(n), a second vector joining unit 14 _(n), a first permutation application unit 15 _(n), a second vector generation unit 16 _(n), a first inverse permutation application unit 17 _(n), and a first vector extraction unit 18 _(n), for example.

By the components of the secure computing apparatus 1 _(n) (1≤n≤N) performing processing at each step described later in cooperation with the components of other secure computing apparatus 1 _(n′) (n′=1, . . . , N; where n≠n′), a secure strong mapping computing method according to an embodiment is implemented.

The processing at each step is performed in secure computation. That is, the secure computing apparatus 1 _(n) performs the processing at each step without reconstructing a share, in other words, without knowing the content of the share.

The secure computing apparatus 1 _(n) is a special apparatus configured by loading of a special program into a well-known or dedicated computer having a central processing unit (CPU), main storage unit (random access memory: RAM), and the like, for example. The secure computing apparatus 1 _(n) executes various kinds of processing under control of the central processing unit, for example. Data input to the secure computing apparatus 1 _(n) and data resulting from processing are stored in the main storage unit, for example, and the data stored in the main storage unit is read into the central processing unit as necessary to be used for other processing. The components of the secure computing apparatus 1 _(n) may at least partially consist of hardware such as an integrated circuit.

For the following description, [α] is assumed to be a share generated by secret sharing of α, with α being an arbitrary vector or an arbitrary permutation.

Referring to FIG. 3, the processing procedure of the secure strong mapping computing method which is performed by the secure joining system in the embodiment is described.

The secure strong mapping computing system and method are for computing a vector y which is output when a mapping defined by a vector r ∈F_(k) ^(m) corresponding to the domain of definition, a vector d∈F_(v) ^(m) corresponding to a range, and an outlier u is applied to a vector x corresponding to input. m and n are predetermined integers greater than or equal to 1, the outlier u is a predetermined value, r∈F_(k) ^(m) is a predetermined vector with elements different from each other, and d∈F_(v) ^(m) and x∈F_(k) ^(n) are predetermined vectors.

When r_(i) is the ith element of the vector r, d_(i) is the ith element of the vector d, x_(i) is the ith element of the vector x, and y_(i) is the ith element of the vector y, this mapping is a mapping that assumes y_(i)=d when j with x_(i)=r_(j) exists and assumes y_(i)=u when j with x_(i)=r_(j) does not exist.

For example, in the case of the vector r=(1, 3, 2), the vector d=(2, 5, 1), u=−1, and the vector x=(1, 0, 2, 5, 3), application of the mapping to the vector x=(1, 0, 2, 5, 3) gives a vector: the vector y=(2, −1, 1, −1, 5).

<Step S1>

A share [r] of the vector r and a share [x] of the vector x are input to the first vector joining units 11 ₁, . . . , 11 _(N).

The first vector joining units 11 ₁, . . . , 11 _(N) each generate a share [k] of a vector k∈[F_(k)]^(2m+n) which is generated by joining the vector r, the vector x, and the same vector as the vector r (step S1).

The generated share [k] is output to the first permutation calculation units 12 ₁, . . . , 12 _(N).

For example, assume that the vector r=(1, 3, 2) and the vector x=(1, 0, 2, 5, 3) hold. Then, the vector k=(1, 3, 2, 1, 0, 2, 5, 3, 1, 3, 2) is yielded.

<Step S2>

The share [k] is input to the first permutation calculation units 12 ₁, . . . , 12 _(N).

The first permutation calculation units 12 ₁, . . . , 12 _(N) each use the share [k] to generate a share [σ] of a permutation σ for stable sorting of the vector k (step S2).

The share [σ] is output to the first vector generation units 13 ₁, . . . , 13 _(N).

For example, the permutation σ=(4, 0, 3, 8, 2, 5, 10, 1, 7, 9, 6) is yielded when the vector k=(1, 3, 2, 1, 0, 2, 5, 3, 1, 3, 2).

Generation of the share [σ] of the permutation σ for performing a stable sort can be implemented with the approach of Reference Literature 1, for example.

[Reference Literature 1] Dai Ikarashi, Koki Hamada, Ryo Kikuchi, and Koji Chida, “A Design and an Implementation of Super-high-speed Multi-party Sorting: The Day When Multi-party Computation Reaches Scripting Languages”, CSS2017, 2017

<Step S3>

A share [d] of the vector d and u are input to the first vector generation units 13 ₁, . . . , 13 _(N).

The first vector generation units 13 ₁, . . . , 13 _(N) each use the share [d] and u to generate a share [d′] of a vector d′, which is a vector generated by subtracting u from the respective elements of the vector d (step S3).

The share [d′] is output to the second vector joining units 14 ₁, . . . , 14 _(N).

For example, the vector d′=(3, 6, 2) is yielded when the vector d=(2, 5, 1) and u=−1.

<Step S4>

The share [d′] is input to the second vector joining units 14 ₁, . . . , 14 _(N).

The second vector joining units 14 ₁, . . . , 14 _(N) each use the share [d′] to generate a share [v] of a vector v∈[F_(v)]^(2m+n) which is generated by joining the vector d′, a 0-vector with a number of elements of n, and a vector −d′ which is a vector generated by inverting the signs of the respective elements of the vector d′ (step S4).

The share [v] is output to the first permutation application units 15 ₁, . . . , 15 _(N).

For example, the vector v=(3, 6, 2, 0, 0, 0, 0, 0, −3, −6, −2) is yielded when the vector d′=(3, 6, 2) and n=5.

<Step S5>

The share [v] and the share [σ] are input to the first permutation application units 15 ₁, . . . , 15 _(N).

The first permutation application units 15 ₁, . . . , 15 _(N) each use the share [v] and the share [σ] to generate a share [σ(v)] of a vector σ(v) which is generated by application of the permutation σ to the vector v (step S5).

The share [σ(v)] is output to the second vector generation units 16 ₁, . . . , 16 _(N).

For example, the vector σ(v)=(0, 3, 0, −3, 2, 0, −2, 6, 0, −6, 0) is yielded when the permutation σ=(4, 0, 3, 8, 2, 5, 10, 1, 7, 9, 6) and the vector v=(3, 6, 2, 0, 0, 0, 0, 0, −3, −6, −2).

<Step S6>

The share [σ(v)] is input to the second vector generation units 16 ₁, . . . , 16 _(N).

The second vector generation units 16 ₁, . . . , 16 _(N) each use the share [σ(v)] to generate a share [σ(y)] of a vector σ(y), each element of which is the sum of u and the sum of the elements of the vector σ(v) up to the element corresponding to that element, the elements including the element corresponding to that element (step S6). In other words, the second vector generation units 16 ₁, . . . , 16 _(N) calculate the prefix-sum of the vector σ(v) with the initial value being u, as σ(y). When σ(v)_(i) is the ith element of σ(v) and σ(y)_(i) is the ith element of σ(y), σ(y)_(i)=u+Σ_(j=1) ^(i)σ(v)_(j) is yielded.

The share [σ(y)] is output to the first inverse permutation application units 17 ₁, . . . , 17 _(N).

For example, the vector σ(y)=(−1, 2, 2, −1, 1, 1, −1, 5, 5, −1, −1) is yielded when the vector σ(v)=(0, 3, 0, −3, 2, 0, −2, 6, 0, −6, 0).

<Step S7>

The share [σ(y)] and the share [σ] are input to the first inverse permutation application units 17 ₁, . . . , 17 _(N).

The first inverse permutation application units 17 ₁, . . . , 17 _(N) each use the share [σ(y)] and the share [σ] to generate a share [σ⁻¹(σ(y))] of a vector σ⁻¹(σ(y)) which is generated by application of an inverse permutation σ⁻¹ of the permutation σ to the vector σ(y) (step S7).

The share [σ⁻¹(σ(y))] is output to the first vector extraction units 18 ₁, . . . , 18 _(N).

For example, the vector σ⁻¹(σ(y))=(2, 5, 1, 2, −1, 1, −1, 5, −1, −1, −1) is yielded when the permutation σ=(4, 0, 3, 8, 2, 5, 10, 1, 7, 9, 6) and the vector σ(y)=(−1, 2, 2, −1, 1, 1, −1, 5, 5, −1, −1).

<Step S8>

The share [σ⁻¹(σ(y))] is input to the first vector extraction units 18 ₁, . . . , 18 _(N).

The first vector extraction units 18 ₁, . . . , 18 _(N) each use the share [σ⁻¹(σ(y))] to obtain a share [y] of the vector y which is generated by extracting the m+1th to the m+nth elements of the vector σ⁻¹(σ(y)) (step S8).

For example, the vector y=(2, −1, 1, −1, 5) is yielded when the vector σ⁻¹(σ(y))=(2, 5, 1, 2, −1, 1, −1, 5, −1, −1, −1).

The vector y=(2, −1, 1, −1, 5) represents a vector that is output when applying the mapping with the vector r=(1, 3, 2), the vector d=(2, 5, 1), u=−1, and the vector x=(1, 0, 2, 5, 3) to the vector x=(1, 0, 2, 5, 3). The first element “1”, the third element “2”, and the fifth element “3” of the vector x=(1, 0, 2, 5, 3) have been mapped to the first element “2”, the third element “1”, and the fifth element “5” of the vector y=(2, −1, 1, −1, 5), respectively, via the mapping. Also, the second element “0” and the fourth element “5” of the vector x=(1, 0, 2, 5, 3) have been mapped to the outlier “−1” via the mapping because they are values that do not exist in the elements of the vector r, which corresponds to the domain of definition.

In this manner, mapping computation can be performed while detecting outliers with the secure strong mapping computing system and method.

In the following, embodiments of the secure joining system and method using the secure strong mapping computing system and method are described.

[Secure Joining System and Method for Performing Left Outer Join]

Referring to FIG. 1, an exemplary configuration of a secure joining system according to an embodiment is described. This secure joining system and method performs so-called left outer join. Left outer join is discussed later.

The secure joining system includes N (≥2) secure computing apparatuses 1 ₁, . . . , 1 _(N) as with the secure strong mapping computing system. In this embodiment, the secure computing apparatuses 1 ₁, . . . , 1 _(N) are each connected to the communication network 2. The communication network 2 is a circuit-switched or packet-switched communication network configured to allow communications between connected apparatuses, and can be the Internet, a local area network (LAN), a wide area network (WAN), and the like, for example. The apparatuses do not necessarily be capable of communicating online via the communication network 2. For example, they may be configured such that information entered to the secure computing apparatuses 1 ₁, . . . , 1 _(N) is stored in a portable recording medium such as magnetic tape or a USB memory and the information is entered offline to the secure computing apparatuses 1 ₁, . . . , 1 _(N) from the portable recording medium.

Referring to FIG. 4, an exemplary configuration of a secure computing apparatus 1 _(n) (n=1, . . . , N) included in the secure joining system is described. As shown in FIG. 4, the secure computing apparatus 1 _(n) of the secure joining system includes the first vector joining unit 11 _(n), the first permutation calculation unit 12 _(n), the first vector generation unit 13 _(n), the second vector joining unit 14 _(n), the first permutation application unit 15 _(n), the second vector generation unit 16 _(n), the first inverse permutation application unit 17 _(n), the first vector extraction unit 18 _(n), a second permutation application unit 19 _(n), a third vector extraction unit 110 _(n), a second inverse permutation application unit 111 _(n), a second vector extraction unit 112 _(n), a modified second table generation unit 113 _(n), a third permutation application unit 114 _(n), a fourth vector generation unit 115 _(n), a shifting unit 116 _(n), a third inverse permutation application unit 117 _(n), a bit inversion unit 118 _(n), a third vector extraction unit 119 _(n), a modified first table generation unit 120 _(n), a first table joining unit 121 _(n), and a first table formatting unit 122 _(n), for example.

The first vector joining unit 11 _(n), the first permutation calculation unit 12 _(n), the first vector generation unit 13 _(n), the second vector joining unit 14 _(n), the first permutation application unit 15 _(n), the second vector generation unit 16 _(n), the first inverse permutation application unit 17 _(n), and the first vector extraction unit 18 _(n) of the secure computing apparatus 1 _(n), which are enclosed by dashed line in FIG. 4, can be said to be a portion corresponding to the secure strong mapping computing system.

By the components of the secure computing apparatus 1 _(n) (1≤n≤N) performing processing at each step described later in cooperation with the components of other secure computing apparatus 1 _(n′) (n′=1, . . . , N; where n≠n′), a secure joining method according to an embodiment is implemented.

The processing at each step is performed in secure computation. That is, the secure computing apparatus 1 _(n) performs the processing at each step without reconstructing a share, in other words, without knowing the content of the share.

The secure computing apparatus 1 _(n) is a special apparatus configured by loading of a special program into a well-known or dedicated computer having a central processing unit (CPU), main storage unit (random access memory: RAM), and the like, for example. The secure computing apparatus 1 _(n) executes various kinds of processing under control of the central processing unit, for example. Data input to the secure computing apparatus 1 _(n) and data resulting from processing are stored in the main storage unit, for example, and the data stored in the main storage unit is read into the central processing unit as necessary to be used for other processing. The components of the secure computing apparatus 1 _(n) may at least partially consist of hardware such as an integrated circuit.

Referring to FIG. 5, the processing procedure of the secure joining method which is performed by the secure joining system in the embodiment is described.

The secure joining system described below performs left outer join of a first table and a second table. In other words, the secure joining system described below joins records that are common to the first table and the second table with records that exist only in the first table while maintaining confidentiality.

Assume that m, n, L₁, and L₂ are integers greater than or equal to 1. m, n, L₁, and L₂ may be the same value or different values.

The first table has in records. Each one of the in records has one key and attribute values of L₁ attributes. Let k₁∈F_(k) ^(m) be a vector of the keys of the first table. It is assumed that there are no overlapping keys in the first table.

The second table has n records. Each one of the n records has one key and attribute values of L₂ attributes. Let k₂∈F_(k) ^(n) be a vector of the keys of the second table. It is assumed that overlapping keys are permitted in the second table.

For example, assume that the first table has three records and consists of a vector of keys, k₁=(3, 5, 9), and a vector of the attribute values of one attribute v₁, v₁=(100, 19, 85).

Also assume that the second table has four records and consists of a vector of keys, k₂=(3, 7, 9, 9), and a vector of the attribute values of one attribute v₂, v₂=(water, mix au lait, drug, water).

In a case where the first table contains the attribute values of multiple attributes, v₁ may be a vector which is a concatenation of the attribute values of the multiple attributes. For example, assume that the first table has two records and contains the attribute values of two attributes, where the vector of the attribute values of the first attribute is v_(1,1)=(29, 169) and the vector of the attribute values of the second attribute is v_(1,1)=(35, 175). In this case, v₁ may be the vector v₁=((29, 35), (169, 175)), which is a concatenation of the attribute values of these two attributes.

Similarly, in a case where the second table contains the attribute values of multiple attributes, v₂ may be a vector which is a concatenation of the attribute values of the multiple attributes.

Since in general a vector with its elements being rings is also a ring, data formed by arranging the values of the respective attributes contained in a record can be considered to be a vector, that is, a ring.

First, with processing at the <step S1> to <step S8> of the secure strong mapping computing system and method described above, the vector y that is output when a mapping defined by r, d, and u is applied to x is calculated, where the vector corresponding to the domain of definition is the vector r=k₁, the vector corresponding to the range is the vector d=v₁, and the vector corresponding to input is the vector x=k₂. This results in the attribute values of the attribute v₁ of the first table that correspond to the records of the second table. An attribute value corresponding to a record which is a record of the second table and which corresponds to a key that does not exist in the first table will be the outlier u.

As the processing at <step S1> to <step S8> is similar to the processing of the processing at <step S1> to <step S8> described in Section [Secure strong mapping computing system and method], overlapping description is not repeated here.

For example, in the case of the vector r=k₁=(3, 5, 9), the vector d=v₁=(100, 19, 85), u=−1, and x=k₂=(3, 7, 9, 9), application of the mapping to the vector x=(3, 7, 9, 9) gives a vector: the vector y=(100, −1, 85, 85). Since the second element “7” of the vector x=k₂=(3, 7, 9, 9) does not exist in the elements of the vector r=k₁=(3, 5, 9), the second element of the vector y=(100, −1, 85, 85) is the outlier u=−1. In this manner, the vector y is calculated such that an attribute value corresponding to a record which is a record of the second table and which corresponds to a key that does not exist in the first table will be the outlier u.

<Step S9>

To the second permutation application units 19 ₁, . . . , 19 _(N), a share [g] of a vector g∈[F]^(2m+n) which is generated by joining in elements each being 1, n elements each being 0, and in elements each being −1, and the share [σ] are input. Here, F is an arbitrary ring.

The second permutation application units 19 ₁, . . . , 19 _(N) each generate a share [σ(g)] of a vector σ(g) which is generated by application of the permutation σ to the vector g, using the share [g] of the vector g∈[F]^(2m+n) which is generated by joining in elements each being 1, n elements each being 0, and in elements each being −1, and the share [σ] (step S9).

The share [σ(g)] is output to the third vector generation units 110 ₁, . . . , 110 _(N).

For example, for example, g=(1, 1, 1, 0, 0, 0, 0, −1, −1, −1) and σ(g)=(1, 0, −1, 1, −1, 0, 1, 0, 0, −1) are yielded when m=3 and n=4 hold and the permutation σ is σ defined by the formula (1) below.

$\begin{matrix} {\sigma = \begin{pmatrix} 3 & 5 & 9 & 3 & 7 & 9 & 9 & 3 & 5 & 9 \\ 3 & 3 & 3 & 5 & 5 & 7 & 9 & 9 & 9 & 9 \end{pmatrix}} & (1) \end{matrix}$

Here, each sequence (i, j)^(T) of the permutation σ means that the ith element of the vector to which the permutation is applied is moved to the jth element.

<Step S10>

The share [σ(g)] is input to the third vector generation units 110 ₁, . . . , 110 _(N).

The third vector generation units 110 ₁, . . . , 110 _(N) each use the share [σ(g)] to generate a share [σ(g′)] of a vector σ(g′), each element of which is the sum of the elements of the vector σ(g) up to the element corresponding to that element, the elements including the element corresponding to that element (step S10). In other words, the third vector generation units 110 ₁, . . . , 110 _(N) calculate the prefix-sum of σ(g) as σ(g′). When σ(g)_(i) is the ith element of σ(g) and σ(g′)_(i) is the ith element of σ(g′), σ(g′)_(i)=Σ_(j=1) ^(i)σ(g)_(j) is yielded.

The share [σ(g′)] is output to the second inverse permutation application units 111 ₁, . . . , 111 _(N).

For example, σ(g′)=(1, 1, 0, 1, 0, 0, 1, 1, 1, 0) is yielded when σ(g)=(1, 0, −1, 1, −1, 0, 1, 0, 0, −1).

<Step S11>

The share [σ(g′)] and a share [g′] are input to the second inverse permutation application units 111 ₁, . . . , 111 _(N).

The second inverse permutation application units 111 ₁, . . . , 111 _(N) each use the share [σ(g′)] and the share [g′] to generate a share [g′] of a vector g′ which is generated by application of the inverse permutation σ⁻¹ of the permutation σ to the vector σ(g′) (step S11).

The share [g′] is output to the second vector extraction units 112 ₁, . . . , 112 _(N).

For example, g′=(1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0) is yielded when σ(g′)=(1, 1, 0, 1, 0, 0, 1, 1, 1, 0).

<Step S12>

The share [g′] is input to the second vector extraction units 112 ₁, . . . , 112 _(N).

The second vector extraction units 112 ₁, . . . , 112 _(N) each use the share [g′] to generate a share [f1′] of a vector f1′ which is generated by extracting the m+1th to m+nth elements of the vector g′ (step S12).

The share [f1′] is output to the modified second table generation units 113 ₁, . . . , 113 _(N).

For example, f1′=(1, 0, 1, 1) is yielded when m=3, n=4, and g′=(1, 1, 1, 1, 0, 1, 1, 0, 0, 0).

<Step S13>

The share [f1′] and the share [y] are input to the modified second table generation units 113 ₁, . . . , 113 _(N).

The modified second table generation units 113 ₁, . . . , 113 _(N) each use the share [f1′] and the share [y] to generate a modified second table by joining the vector f1′, the vector f1′ if f1′_(i)=0 with i=1, . . . , n, and a table having the ith element of the attribute of the second table as u_(v2), and the vector y (step S13). u_(v2) is a predetermined value.

The modified second table is output to the first table joining units 121 ₁, . . . , 121 _(N).

For example, in a case where the second table consists of the vector of keys, k₂=(3, 7, 9, 9), and the vector of the attribute values of the one attribute v₂, v₂=(water, mix au lait, drug, water), with f1′=(1, 0, 1, 1) and the vector (100, −1, 85, 85), the modified second table will be the table shown below. In the modified second table below, if f1′_(i)=0 with i=1, . . . , n, the ith element of the key of the second table is turned into u=−1.

(A) f1′ k₂ v₁ v₂ 1 3 100 water 0 −1 −1 u_(v2) 1 9 85 drug 1 9 85 water

<Step S14>

To the third permutation application units 114 ₁, . . . , 114 _(N), a share [e] of a vector e∈[F]^(2m+n) which is generated by joining in elements each being 1, n elements each being 0, and in elements each being −1, and the share [σ] are input.

The third permutation application units 114 ₁, . . . , 114 _(N) each use the share [e] of the vector e∈[F]^(2m+n) and the share [σ] to generate a share [σ(e)] of a vector σ(e) which is generated by application of the permutation σ to the vector e (step S14).

The share [σ(e)] is output to the fourth vector generation units 115 ₁, . . . , 115 _(N).

For example, for example, g=(1, 1, 1, 0, 0, 0, 0, −1, −1, −1) and σ(g)=(1, 0, −1, 1, −1, 0, 1, 0, 0, −1) are yielded when m=3 and n=4 hold and the permutation σ is σ defined by the formula (1) above.

<Step S15>

The share [σ(e)] is input to the fourth vector generation units 115 ₁, . . . , 115 _(N).

The fourth vector generation units 115 ₁, . . . , 115 _(N) each use the share [σ(e)] to generate a share [σ(e′)] of a vector σ(e′), each element of which is the sum of the elements of the vector σ(e) up to the element corresponding to that element, the elements including the element corresponding to that element (step S15). In other words, the fourth vector generation units 115 ₁, . . . , 115 _(N) calculate the prefix-sum of σ(e) as σ(e′).

The share [σ(e′)] is output to the shifting units 116 ₁, . . . , 116 _(N).

For example, σ(e′)=(1, 1, 0, 1, 0, 0, 1, 1, 1, 0) is yielded when σ(e)=(1, 0, −1, 1, −1, 0, 1, 0, 0, −1).

<Step S16>

The share [σ(e′)] is input to the shifting units 116 ₁, . . . , 116 _(N).

The shifting units 116 ₁, . . . , 116 _(N) each use the share [σ(e′)] to generate a share [σ(e″)] of a vector σ(e″) which is generated by shifting the elements of the vector σ(e) by one (step S16). In the case of shifting the elements of the vector σ(e) each by one forward (to the left), the last element (the rightmost element) of the vector σ(e″) is set to 0, for example. Similarly, in the case of shifting the elements of the vector σ(e) each by one backward (to the right), the first element (the leftmost element) of the vector σ(e″) is set to 0, for example.

The share [σ(e″)] is output to the third inverse permutation application units 117 ₁, . . . , 117 _(N).

For example, the vector σ(e″)=(1, 0, 1, 0, 0, 1, 1, 1, 0, 0) is yielded when σ(e′)=(1, 1, 0, 1, 0, 0, 1, 1, 1, 0) and the elements are shifted forward (to the left) by one.

<Step S17>

The share [σ(e″)] and the share [σ] are input to the third inverse permutation application units 117 ₁, . . . , 117 _(N).

The third inverse permutation application units 117 ₁, . . . , 117 _(N) each use the share [σ(e″)] and the share [σ] to generate a share [e″] of a vector e″ which is generated by application of the inverse permutation σ⁻¹ of the permutation σ to the vector σ(e″) (step S17).

The share [e″] is output to the bit inversion units 118 ₁, . . . , 118 _(N).

For example, the vector e″=(1, 0, 1, 0, 1, 1, 0, 1, 0, 0) is yielded when the vector σ(e″)=(1, 0, 1, 0, 0, 1, 1, 1, 0, 0) holds and the permutation σ is σ defined by the formula (1) above.

<Step S18>

The share [e″] is input to the bit inversion units 118 ₁, . . . , 118 _(N).

The bit inversion units 118 ₁, . . . , 118 _(N) each use the share [e″] to generate a share [f] of a vector f which is generated by inverting 0 and 1 of the elements of the vector e″ (step S18).

The share [f] is output to the third vector extraction units 119 ₁, . . . , 119 _(N).

For example, the vector f=(0, 1, 0, 1, 0, 0, 1, 0, 1, 1) is yielded when the vector e″=(1, 0, 1, 0, 1, 1, 0, 1, 0, 0).

<Step S19>

The share [f] is input to the third vector extraction units 119 ₁, . . . , 119 _(N).

The third vector extraction units 119 ₁, . . . , 119 _(N) each use the share [f] to generate a share [f′] of a vector f′ which is generated by extracting in elements of the vector f from the left (step S19).

The share [f′] is output to the modified first table generation units 120 ₁, . . . , 120 _(N).

For example, the vector f′=(0, 1, 0) is yielded when the vector f=(0, 1, 0, 1, 0, 0, 1, 0, 1, 1).

The vector f′ represents the positions of records that exist only in the first table. For example, the vector f′=(0, 1, 0) means that the second record of the first table exists only in the first table and is absent in the second table.

<Step S20>

The share [f′], the share [r], and the share [d] are input to the modified first table generation units 120 ₁, . . . , 120 _(N).

The modified first table generation units 120 ₁, . . . , 120 _(N) each use the share [f′], the share [r], and the share [d] to generate a modified first table by joining the vector f′, the vector f′ having the ith element of the key of the first table as u_(k) if f′_(i)=0 with i=1, . . . , m, a table having the ith element of the attribute of the first table as u_(v1), and a vector with elements being as a vector corresponding to the attribute of the second table, where f′_(i) is the ith element of the vector f′, r_(i) is the ith element of the vector r, and u_(k) and u_(v1) are predetermined values (step S20).

The modified first table is output to the first table joining units 121 ₁, . . . , 121 _(N).

For example, in a case where u_(k), u_(v1)=−1 and the vector f′=(0, 1, 0) hold, the first table has three records and consists of the vector of keys, k₁=(3, 5, 9), and the vector of the attribute values of the one attribute v₁, v₁=(100, 19, 85), and r=k₁ and d=v₁ hold, the modified first table will be the table shown below.

(B) f′ k₁ v₁ v₂ 0 −1 −1 u_(v2) 1 5 19 u_(v2) 0 9 −1 u_(v2)

<Step S21>

The modified second table and the modified first table are input to the first table joining units 121 ₁, . . . , 121 _(N).

The first table joining units 121 ₁, . . . , 121 _(N) each generate a joined table by joining the modified second table and the modified first table (step S21).

For example, when the modified second table is the one shown in (A) above and the modified first table is the one shown in (B) above, the joined table will be the table shown below. In the joined table below, a vector generated by joining the flag vector f1′ and f is represented as f″.

(c) f″ k₂ v₁ v₂ 1 3 100 water 0 −1 −1 u_(v2) 1 9 85 drug 1 9 85 water 0 −1 −1 u_(v2) 1 5 19 u_(v2) 0 −1 −1 u_(v2)

<Step S22>

The shares [f1′] and [f′] are input to the first table formatting units 122 ₁, . . . , 122 _(N).

The first table formatting units 122 ₁, . . . , 122 _(N) each use the joined table and the shares [f1′] and [f′] to generate a formatted joined table by extracting, from the joined table, records for which the elements of the vector f1′ and the vector f′ (in other words, the elements of the vector f″ which is generated by joining the vector f1′ and the vector f′) are 1 (step S22).

For example, when the joined table is the joined table (C) above, the formatted joined table will be the table shown below.

(C) f″ k₂ v₁ v₂ 1 3 100 water 1 9 85 drug 1 9 85 water 1 5 19 u_(v2)

Alternatively, the first table formatting units 122 ₁, . . . , 122 _(N) may generate the formatted joined table by sorting by the vector f″ which is generated by joining the vector f1′ and the vector f′ and thereafter extracting the records for which the elements of the vector f″ are 1. In this case, the share [f″] of the vector f″ may be released.

This formatted joined table is a left outer join of the first table and the second table.

[Secure Joining System and Method for Performing Right Outer Join]

Referring to FIG. 1, an exemplary configuration of a secure joining system according to an embodiment is described. This secure joining system and method performs so-called right outer join. In other words, this secure joining system joins records that are common to the first table and the second table with records that exist only in the second table while maintaining confidentiality.

The secure joining system for performing right outer join is similar to the secure joining system for performing left outer join except that it includes a modified second table generation unit 123 _(n), instead of including the second permutation application unit 19 _(n), the third vector extraction unit 110 _(n), the second inverse permutation application unit 111 _(n), the second vector extraction unit 112 _(n), the modified second table generation unit 113 _(n), the third permutation application unit 114 _(n), the fourth vector generation unit 115 _(n), the shifting unit 116 _(n), the third inverse permutation application unit 117 _(n), the bit inversion unit 118 _(n), the third vector extraction unit 119 _(n), the modified first table generation unit 120 _(n), the first table joining unit 121 _(n), and the first table formatting unit 122 _(n).

The secure joining method for performing right outer join is similar to the secure joining method for performing left outer join except that it performs the processing at step S23 instead of performing the processing at step S9 to step S22.

In the following, differences from the secure joining system and method for performing left outer join are described. The same portions as those of the secure joining system and method for performing left outer join are not described again.

As shown in FIG. 6, the secure computing apparatus 1 _(n) of the secure joining system includes the first vector joining unit 11 _(n), the first permutation calculation unit 12 _(n), the first vector generation unit 13 _(n), the second vector joining unit 14 _(n), the first permutation application unit 15 _(n), the second vector generation unit 16 _(n), the first inverse permutation application unit 17 _(n), the first vector extraction unit 18 _(n), and the modified second table generation unit 123 _(n), for example.

The first vector joining unit 11 _(n), the first permutation calculation unit 12 _(n), the first vector generation unit 13 _(n), the second vector joining unit 14 _(n), the first permutation application unit 15 _(n), the second vector generation unit 16 _(n), the first inverse permutation application unit 17 _(n), and the first vector extraction unit 18 _(n) of the secure computing apparatus 1 _(n), which are enclosed by dashed line in FIG. 6, can be said to be a portion corresponding to the secure strong mapping computing system.

Referring to FIG. 7, the processing procedure of the secure joining method which is performed by the secure joining system in the embodiment is described.

As the processing at <step S1> to <step S8> is similar to the processing at <step S1> to <step S8> described in Section [Secure strong mapping computing system and method], overlapping description is not repeated here.

For example, in the case of the vector r=k₁=(3, 5, 9), the vector d=v₁=(100, 19, 85), u=−1, and x=k₂=(3, 7, 9, 9), application of the mapping to the vector x=(3, 7, 9, 9) gives a vector: the vector y=(100, −1, 85, 85). Since the second element “7” of the vector x=k₂=(3, 7, 9, 9) does not exist in the elements of the vector r=k₁=(3, 5, 9), the second element of the vector y=(100, −1, 85, 85) is the outlier u=−1. In this manner, the vector y is calculated such that an attribute value corresponding to a record which is a record of the second table and which corresponds to a key that does not exist in the first table will be the outlier u.

<Step S23>

The share [y] is input to the modified second table generation units 123 ₁, . . . , 122 _(N).

The modified second table generation units 123 ₁, . . . , 122 _(N) each use the share [y] to generate a modified second table by joining the second table and the vector y (step S23).

For example, in a case where the second table has four records and consists of the vector of keys, k₂=(3, 7, 9, 9), and the vector of the attribute values of the one attribute v₂, v₂=(water, mix au lait, drug, water), with the vector y=(100, −1, 85, 85), the modified second table will be the table shown below.

(D) k₂ v₁ v₂ 3 100 water 7 −1 mix au lait 9 85 drug 9 85 water

This modified second table is a right outer join of the first table and the second table.

[Secure Joining System and Method for Performing Full Outer Join]

Referring to FIG. 8, an exemplary configuration of a secure joining system according to an embodiment is described. This secure joining system and method performs so-called full outer join. In other words, this secure joining system joins records that are common to the first table and the second table, records that exist only in the first table, and records that exist only in the second table while maintaining confidentiality.

The secure joining system for performing full outer join is similar to the secure joining system for performing left outer join and the secure joining system for performing right outer join except that it includes a second table formatting unit 124 _(n) and a second table joining unit 125 _(n), instead of including the first table joining unit 121 _(n) and the first table formatting unit 122 _(n).

The secure joining method for performing full outer join is similar to the secure joining method for performing left outer join and the secure joining method for performing right outer join except that it performs the processing at steps S24 and S25 instead of performing the processing at step S21 and step S22.

In the following, differences from the secure joining system and method for performing left outer join and the secure joining system and method for performing right outer join are described. The same portions as those of the secure joining system and method for performing left outer join and the secure joining system and method for performing right outer join are not described again.

As shown in FIG. 8, the secure computing apparatus 1 _(n) of the secure joining system includes the first vector joining unit 11 _(n), the first permutation calculation unit 12 _(n), the first vector generation unit 13 _(n), the second vector joining unit 14 _(n), the first permutation application unit 15 _(n), the second vector generation unit 16 _(n), the first inverse permutation application unit 17 _(n), the first vector extraction unit 18 _(n), the second permutation application unit 19 _(n), the third vector extraction unit 110 _(n), the second inverse permutation application unit 111 _(n), the second vector extraction unit 112 _(n), the modified second table generation unit 113 _(n), the third permutation application unit 114 _(n), the fourth vector generation unit 115 _(n), the shifting unit 116 _(n), the third inverse permutation application unit 117 _(n), the bit inversion unit 118 _(n), the third vector extraction unit 119 _(n), the modified first table generation unit 120 _(n), the first table joining unit 121 _(n), the first table formatting unit 122 _(n), the modified second table generation unit 123 _(n), the second table formatting unit 124 _(n), and the second table joining unit 125 _(n), for example.

The first vector joining unit 11 _(n), the first permutation calculation unit 12 _(n), the first vector generation unit 13 _(n), the second vector joining unit 14 _(n), the first permutation application unit 15 _(n), the second vector generation unit 16 _(n), the first inverse permutation application unit 17 _(n), and the first vector extraction unit 18 _(n) of the secure computing apparatus 1 _(n), which are enclosed by dashed line in FIG. 8, can be said to be a portion corresponding to the secure strong mapping computing system.

Referring to FIG. 9, the processing procedure of the secure joining method which is performed by the secure joining system in the embodiment is described.

First, processing at <step S1> to <step S8> is performed. As the processing at <step S1> to <step S8> is similar to the processing at <step S1> to <step S8> described in Section [Secure strong mapping computing system and method], overlapping description is not repeated here.

For example, in the case of the vector r=k₁=(3, 5, 9), the vector d=v₁=(100, 19, 85), u=−1, and x=k₂=(3, 7, 9, 9), application of the mapping to the vector x=(3, 7, 9, 9) gives a vector: the vector y=(100, −1, 85, 85). Since the second element “7” of the vector x=k₂=(3, 7, 9, 9) does not exist in the elements of the vector r=k₁=(3, 5, 9), the second element of the vector y=(100, −1, 85, 85) is the outlier u=−1. In this manner, the vector y is calculated such that an attribute value corresponding to a record which is a record of the second table and which corresponds to a key that does not exist in the first table will be the outlier u.

Next, the processing at <step S23> is performed. As the processing at <step S23> is similar to the processing at <step S23> described in Section [Secure joining system and method for performing right outer join], overlapping description is not repeated here.

For example, in a case where the second table has four records and consists of the vector of keys, k₂=(3, 7, 9, 9), and the vector of the attribute values of the one attribute v₂, v₂=(water, mix au lait, drug, water), with the vector y=(100, −1, 85, 85), the modified second table will be the table shown below.

(D) k₂ v₁ v₂ 3 100 water 7 −1 mix au lait 9 85 drug 9 85 water

Next, processing at <step S9> to <step S20> is performed. As the processing at <step S9> to <step S20> is similar to the processing at <step S9> to <step S20> described in Section [Secure joining system and method for performing left outer join], overlapping description is not repeated here.

Next, processing at <step S24> and <step S25> is performed.

<Step S24>

The share [f′] is input to the second table formatting units 124 ₁, . . . , 124 _(N).

The second table formatting units 124 ₁, . . . , 124 _(N) each use the modified first table and the share [f′] to generate a formatted modified first table by extracting, from the modified first table, records for which the elements of the vector f′ are 1 (step S24).

The formatted modified first table is output to the second table joining units 125 ₁, . . . , 125 _(N).

For example, when the modified first table is the table (B) above, the formatted modified first table will be the table shown below.

5 19 u_(v2) (E)

<Step S25>

The modified second table and the formatted modified first table are input to the second table joining units 125 ₁, . . . , 125 _(N).

The second table joining units 125 ₁, . . . , 125 _(N) each generate a joined table by joining the modified second table and the formatted modified first table (step S25).

For example, when the modified second table is the table (D) above and the formatted modified first table is the table (E) above, the joined table will be the table shown below.

k₂ v₁ v₂ 3 100 water 7 −1 mix au lait 9 85 drug 9 85 water 5 19 u_(v2)

This table is a full join of the first table and the second table.

MODIFICATIONS

While the embodiments of the present invention have been described, specific configurations are not limited to these embodiments, but design modifications and the like within a range not departing from the spirit of the invention are encompassed in the scope of the invention, of course.

For example, the attribute of a key may be a composite key of z attributes, where z is a positive integer greater than or equal to 2. In this case, the processing at step S1 may be performed in the following manner, for example.

Assume r₀, . . . , r_(z?1) instead of r. Assume x₀, . . . , x_(z?1) instead of x.

In this case, the processing at step S1 joins r_(i) and x_(i), then again with r_(i) to obtain k_(i) for each i (where i=0, . . . , z−1). Then, each k_(i) is turned into a bit representation by bit decomposition and joined horizontally. For example, when k₀=(1, 2, 3, 1, 3, 0, 1, 1, 2, 3)^(T) and k₁=(0, 0, 0, 0, 0, 1, 1, 0, 0, 0)^(T), bit decomposition of k₀ results in (k₀)₀=(1, 0, 1, 1, 1, 0, 1, 1, 0, 1)^(T) and (k₀)₁=(0, 1, 1, 0, 1, 0, 0, 0, 1,1)^(T).

Here, since k₀ assumes a value from 1 to 3, each element of k₀ can be represented in 2 bits. (k₀)₀ is the lower bit of k₀ upon bit decomposition, and (k₀)₁ is the upper bit of k₀ upon bit decomposition. Since k₁ is inherently a 1-bit number in this example, it does not require decomposition and k₁=(k₁)₀ is assumed. Horizontal joining of (k₀)₀, (k₀)₁, and (k₁)₀ gives:

$\begin{pmatrix} 1. & 0. & 1. & 1. & 1. & 0. & 1 \\ 0. & 1. & 1. & 0. & 1. & 0. & 0 \\ 0. & 0. & 0. & 0. & 0. & 1. & 1 \end{pmatrix}^{T}.$

Regarding such an arrangement as a matrix and regarding each row of this matrix as a bit representation of the keys of one record, a vector of bit representations of keys, (1, 2, 3, 1, 3, 4, 5, 1, 2, 3), is obtained. This vector can be k which is used at step S2 and after. In this manner, a case with a composite key can also be addressed.

For a composite key, overlap of keys refers to whether keys overlap in terms of combination of the values of the all key attributes and it is assumed that mere overlapping of the values of individual attributes is not regarded as an overlap. For example, a combination of (1, 0) and (1, 1) is not an overlap.

The various processes described in the embodiments may be executed in parallel or separately depending on the processing ability of an apparatus executing the process or on any necessity, rather than being executed in time series in accordance with the described order.

[Program and Recording Medium]

When various types of processing functions in the apparatuses described above are implemented on a computer, the contents of processing function to be contained in each apparatus is written by a program. With this program executed on the computer, various types of processing functions in the above-described apparatuses are implemented on the computer.

This program in which the contents of processing are written can be recorded in a computer-readable recording medium. The computer-readable recording medium may be any medium such as a magnetic recording device, an optical disk, a magneto-optical recording medium, and a semiconductor memory.

Distribution of this program is implemented by sales, transfer, rental, and other transactions of a portable recording medium such as a DVD and a CD-ROM on which the program is recorded, for example. Furthermore, this program may be stored in a storage unit of a server computer and transferred from the server computer to other computers via a network so as to be distributed.

A computer which executes such program first stores the program recorded in a portable recording medium or transferred from a server computer once in a storage unit thereof, for example. When the processing is performed, the computer reads out the program stored in the storage unit thereof and performs processing in accordance with the program thus read out. As another execution form of this program, the computer may directly read out the program from a portable recording medium and perform processing in accordance with the program. Furthermore, each time the program is transferred to the computer from the server computer, the computer may sequentially perform processing in accordance with the received program. Alternatively, a configuration may be adopted in which the transfer of a program to the computer from the server computer is not performed and the above-described processing is executed by so-called application service provider (ASP)-type service by which the processing functions are implemented only by an instruction for execution thereof and result acquisition. It should be noted that a program in this form includes information which is provided for processing performed by electronic calculation equipment and which is equivalent to a program (such as data which is not a direct instruction to the computer but has a property specifying the processing performed by the computer).

In this form, the present apparatus is configured with a predetermined program executed on a computer. However, the present apparatus may be configured with at least part of these processing contents realized in a hardware manner. 

1. A secure strong mapping computing system comprising: a plurality of secure computing apparatuses, wherein F_(k) and F_(v) are arbitrary rings; [α] is a share generated by secret sharing of α, with α being an arbitrary vector or permutation; m and n are predetermined integers greater than or equal to 1; u is a predetermined value; r∈F_(k) ^(m) is a predetermined vector with elements different from each other; and d∈F_(v) ^(m) and x∈F_(k) ^(n) are predetermined vectors, and the plurality of secure computing apparatuses include processing circuitry configured to use a share [r] of the vector r and a share [x] of the vector x to generate a share [k] of a vector k∈[F_(k)]^(2m+n) which is generated by joining the vector r, the vector x, and the same vector as the vector r, use the share [k] to generate a share [σ] of a permutation a for stable sorting of the vector k, use a share [d] of the vector d and u to generate a share [d′] of a vector d′, which is a vector generated by subtracting u from respective elements of the vector d, use the share [d′] to generate a share [v] of a vector v∈[F_(v)]^(2m+n) which is generated by joining the vector d′, a 0-vector with a number of elements of n, and a vector −d′ which is a vector generated by inverting signs of respective elements of the vector d′, use the share [v] and the share [σ] to generate a share [σ(v)] of a vector σ(v) which is generated by application of the permutation σ to the vector v, use the share [σ(v)] to generate a share [σ(y)] of a vector σ(y), each element of which is a sum of the u and a sum of elements of the vector σ(v) up to an element corresponding to that element, the elements including the element corresponding to that element, use the share [σ(y)] and the share [σ] to generate a share [σ⁻¹(σ(y))] of a vector σ⁻¹(σ(y)) which is generated by application of an inverse permutation σ⁻¹ of the permutation σ to the vector σ(y), and use the share [σ⁻¹(σ(y))] to obtain a share [y] of a vector y which is generated by extracting m+1th to m+nth elements of the vector σ⁻¹(σ(y)).
 2. A secure strong mapping computing method, where F_(k) and F_(v) are arbitrary rings; [α] is a share generated by secret sharing of α, with α being an arbitrary vector or permutation; m and n are predetermined integers greater than or equal to 1; u is a predetermined value; r∈F_(k) ^(m) is a predetermined vector with elements different from each other; and d∈F_(v) ^(m) and x∈F_(k) ^(n) are predetermined vectors, the secure strong mapping computing method comprising: a first vector joining step in which a plurality of first vector joining units use a share [r] of the vector r and a share [x] of the vector x to generate a share [k] of a vector k∈[F_(k)]^(2m+n) which is generated by joining the vector r, the vector x, and the same vector as the vector r; a first permutation calculation step in which a plurality of first permutation calculation units use the share [k] to generate a share [σ] of a permutation σ for stable sorting of the vector k; a first vector generation step in which a plurality of first vector generation units use a share [d] of the vector d and u to generate a share [d′] of a vector d′, which is a vector generated by subtracting u from respective elements of the vector d; a second vector joining step in which a plurality of second vector joining units use the share [d′] to generate a share [v] of a vector v∈[F_(v)]^(2m+n) which is generated by joining the vector d′, a 0-vector with a number of elements of n, and a vector −d′ which is a vector generated by inverting signs of respective elements of the vector d′; a first permutation application step in which a plurality of first permutation application units use the share [v] and the share [σ] to generate a share [σ(v)] of a vector σ(v) which is generated by application of the permutation σ to the vector v; a second vector generation step in which a plurality of second vector generation units use the share [σ(v)] to generate a share [σ(y)] of a vector σ(y), each element of which is a sum of the u and a sum of elements of the vector σ(v) up to an element corresponding to that element, the elements including the element corresponding to that element; a first inverse permutation application step in which a plurality of first inverse permutation application units use the share [σ(y)] and the share [σ] to generate a share [σ⁻¹(σ(y))] of a vector σ⁻¹(σ(y)) which is generated by application of an inverse permutation σ⁻¹ of the permutation σ to the vector σ(y); and a first vector extraction step in which a plurality of first vector extraction units use the share [σ⁻¹(σ(y))] to obtain a share [y] of a vector y which is generated by extracting m+1th to m+nth elements of the vector σ⁻¹(σ(y)).
 3. A secure computing apparatus of the secure strong mapping computing system according to claim
 1. 4. One or more non-transitory computer readable media that store a program for causing one or more computers to perform the method according to claim
 2. 